//Accepted
#include <cstdio>
#include <cmath>

#include <iostream>
#include <algorithm>

using namespace std;

int t, i, j;
double S1, S2, n, k, x[10], y[10], xt, yt;

void process(){
	for(i=0;i<t;i++){
		scanf("%lf", &x[i]);
		y[i]=1;
	}
	sort(x, x+t);
	t--;
	while(i=t--){
		for(j=0;i--;j++){
			S1= x[j+1] - x[j];
			S2= y[j+1] - y[j];
			n = pow(S1,2) + pow(S2,2);
			k = sqrt(16-n)/2;
			n = sqrt(n);//norma
			
			//poderia ser pela lei dos cossenos
			//(2+k)^2 = 2^2 + 2^2 - 2^2 * 2 * cos(O)
			
			//modulo*(vetor diretor unario) + ponto medio...
			xt = (k*(-S2) / n)  + ( (x[j+1] + x[j])/2 );
			yt = (k*  S1  / n)  + ( (y[j+1] + y[j])/2 );
			x[j] = xt;
			y[j] = yt;
		}
	}
	printf("%.4lf %.4lf\n", x[0], y[0]);
}

int main(){
	//freopen("in.txt", "r", stdin);
	scanf("%d", &t);
	while(t){
		process();
		scanf("%d", &t);
	}
	return 0;
}



/*

a=6*1
b=(6/7)*5+(1/7)*6
c=(b/7)*(b-1)+(1-(b/7))*b



*/
